全文获取类型
收费全文 | 5080篇 |
免费 | 527篇 |
国内免费 | 229篇 |
专业分类
化学 | 1163篇 |
晶体学 | 15篇 |
力学 | 353篇 |
综合类 | 190篇 |
数学 | 2456篇 |
物理学 | 1659篇 |
出版年
2024年 | 5篇 |
2023年 | 39篇 |
2022年 | 86篇 |
2021年 | 204篇 |
2020年 | 133篇 |
2019年 | 159篇 |
2018年 | 157篇 |
2017年 | 239篇 |
2016年 | 259篇 |
2015年 | 199篇 |
2014年 | 313篇 |
2013年 | 456篇 |
2012年 | 241篇 |
2011年 | 302篇 |
2010年 | 230篇 |
2009年 | 258篇 |
2008年 | 282篇 |
2007年 | 297篇 |
2006年 | 228篇 |
2005年 | 231篇 |
2004年 | 208篇 |
2003年 | 177篇 |
2002年 | 150篇 |
2001年 | 126篇 |
2000年 | 100篇 |
1999年 | 106篇 |
1998年 | 97篇 |
1997年 | 62篇 |
1996年 | 69篇 |
1995年 | 71篇 |
1994年 | 47篇 |
1993年 | 44篇 |
1992年 | 35篇 |
1991年 | 31篇 |
1990年 | 21篇 |
1989年 | 19篇 |
1988年 | 21篇 |
1987年 | 20篇 |
1986年 | 16篇 |
1985年 | 16篇 |
1984年 | 24篇 |
1983年 | 7篇 |
1982年 | 13篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1973年 | 4篇 |
排序方式: 共有5836条查询结果,搜索用时 31 毫秒
61.
基于Karhunen-Loève变换和小波谱特征矢量量化的三维谱像数据压缩 总被引:1,自引:1,他引:0
提出了基于Karhunen Lo埁ve变换的小波谱特征矢量量化三维谱像数据压缩方法耍幔颍瑁酰睿澹?Lo埁ve变换 /小波变换 /小波谱特征矢量量化方法应用了Karhunen Lo埁ve变换的消除谱相关性优良性能 ,应用二维小波变换消除空间相关性 ,在小波变换域内应用二维集分割嵌入块编码和一维谱特征矢量量化对三维谱像数据压缩 ,获得较高的压缩性能。实验结果表明 :Karhunen Lo埁ve变换 /小波变换 /小波谱特征矢量量化编码比Karhunen Lo埁ve变换 /小波变换 /改进对块零树编码和Karhunen Lo埁ve变换 /小波变换 /快速矢量量化编码方法在同样压缩比条件下 ,峰值信噪比提高 2dB和 1dB以上 ,而速度提高了 1.5和 8倍 ,整体压缩性能有较大的提高 相似文献
62.
For the purpose of testing the spherical uniformity based on i.i.d. directional data (unit vectors) zi, i=1,…,n, Anderson and Stephens (Biometrika 59 (1972) 613–621) proposed testing procedures based on the statistics Smax=maxu S(u) and Smin=minu S(u), where u is a unit vector and nS(u) is the sum of squares of u′zi's. In this paper, we also consider another test statistic Srange=Smax−Smin. We provide formulas for the P-values of Smax, Smin, Srange by approximating tail probabilities of the limiting null distributions by means of the tube method, an integral-geometric approach for evaluating tail probability of the maximum of a Gaussian random field. Monte Carlo simulations for examining the accuracy of the approximation and for the power comparison of the statistics are given. 相似文献
63.
Francis J. Narcowich Joseph D. Ward Holger Wendland. 《Mathematics of Computation》2005,74(250):743-763
In this paper we discuss Sobolev bounds on functions that vanish at scattered points in a bounded, Lipschitz domain that satisfies a uniform interior cone condition. The Sobolev spaces involved may have fractional as well as integer order. We then apply these results to obtain estimates for continuous and discrete least squares surface fits via radial basis functions (RBFs). These estimates include situations in which the target function does not belong to the native space of the RBF.
64.
Hiroshi Sakamoto 《Journal of Discrete Algorithms》2005,3(2-4):416-430
A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees approximation ratio without suffix tree construction. 相似文献
65.
Ryo Ikehata 《Journal of Mathematical Analysis and Applications》2003,288(2):803-818
We generalize a previous result of Ikehata (Math. Methods Appl. Sci., in press), which studies the critical exponent problem of a semilinear damped wave equation in the one-dimensional half space, to the general N-dimensional half space case. That is to say, one can show the small data global existence of solutions of a mixed problem for the equation utt−Δu+ut=|u|p with the power p satisfying p∗(N)=1+2/(N+1)<p?N/[N−2]+ if we deal with the problem in the N-dimensional half space. 相似文献
66.
We study a system of quasilinear equations describing one-dimensional flow of a viscous compressible heat-conducting medium with a nonmonotone state function and mass force. The large-time behavior of solutions is considered for arbitrarily large initial data. In spite of possible nonuniqueness and discontinuity of the stationary solution, we prove L2-stabilization for the stress and heat flux as t → ∞ along with corresponding global energy estimates for them. The new method of proof utilizes a combination of energy type equalities for the stress and heat flux. Consequently, H1-stabilization of the velocity and temperature along with global estimates for their derivatives are valid as well. 相似文献
67.
从等离子体平板显示器(PDP)的发光原理出发,分析和研究了存贮控制电路的工作原理,提出基于FPGA的电路设计方案,并给出数据整理电路和驱动信号产生电路的具体电路框图,最后给出部分仿真波形. 相似文献
68.
K. Vinay Kumar Reddy B. Sreenivasa Reddy M. Sreenath Reddy Ch. Gopal Reddy P. Yadagiri Reddy K. Rama Reddy 《Radiation measurements》2003,36(1-6):419-423
Studies conducted by Atomic Minerals Directorate of Exploration and Research (AMD) of Hyderabad, India had established the presence of higher concentrations of uranium in Lambapur and Peddagattu areas of Nalgonda district, AP, India and it was estimated that it could be a viable source for commercial extraction. The envisaged extraction process involves dispersion of radioactive particulate matter into atmosphere. Environmental radioactive studies in and around proposed mining areas at this point of time will be extremely useful for establishing base line data before a large scale uranium extraction process comes into existence. To this end, Solid State Nuclear Track Detectors were installed to evaluate indoor radon and thoron concentration levels in the dwellings of the area. The geometric means of radon and thoron concentration levels were found to be (7.1±0.2)×101 and (6.7±0.3)×101 Bq/m3, respectively. Simultaneously, natural background radiation measurements were also made and these levels are found to vary from 770 to 3995 μGy/y in the spatial distribution. 相似文献
69.
无失效数据的Bayes和多层Bayes分析 总被引:3,自引:0,他引:3
本文推广了文献[6]的结果,对指数分布无失效数据的失效率,给出了Bayes估计、Bayes置信上限以及多层Bayes估计,从而可以得到无失效数据可靠度的估计,最后,结合实际问题进行了计算。 相似文献
70.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献